Surprise Maximization
نویسندگان
چکیده
D. Borwein, J.M. Borwein and P. Mar e hal July 25, 1999 The Surprise Examination or Unexpe ted Hanging Paradox has long fas inated mathemati ians and philosophers, as the number of publi ations devoted to it attests. For an exhaustive bibliography on the subje t, the reader is referred to [1℄. 1 Herein, the optimization problems arising from an information theoreti avoidan e of the Paradox are examined and solved. They provide a very satisfa tory appli ation of both the Kuhn-Tu ker theory and of various lassi al inequalities and estimation te hniques. Although the ne essary onvex analyti on epts are re alled in the ourse of the presentation, some elementary knowledge of optimization is assumed. those unfamiliar with this ba kgroundmay simply skip a ouple of proofs and few te hni al details. 2
منابع مشابه
Evidence for surprise minimization over value maximization in choice behavior
Classical economic models are predicated on the idea that the ultimate aim of choice is to maximize utility or reward. In contrast, an alternative perspective highlights the fact that adaptive behavior requires agents' to model their environment and minimize surprise about the states they frequent. We propose that choice behavior can be more accurately accounted for by surprise minimization com...
متن کاملSurprise maximization reveals the community structure of complex networks
How to determine the community structure of complex networks is an open question. It is critical to establish the best strategies for community detection in networks of unknown structure. Here, using standard synthetic benchmarks, we show that none of the algorithms hitherto developed for community structure characterization perform optimally. Significantly, evaluating the results according to ...
متن کاملModular structure of brain functional networks: breaking the resolution limit by Surprise
The modular organization of brain networks has been widely investigated using graph theoretical approaches. Recently, it has been demonstrated that graph partitioning methods based on the maximization of global fitness functions, like Newman's Modularity, suffer from a resolution limit, as they fail to detect modules that are smaller than a scale determined by the size of the entire network. He...
متن کاملDeciphering Network Community Structure by Surprise
The analysis of complex networks permeates all sciences, from biology to sociology. A fundamental, unsolved problem is how to characterize the community structure of a network. Here, using both standard and novel benchmarks, we show that maximization of a simple global parameter, which we call Surprise (S), leads to a very efficient characterization of the community structure of complex synthet...
متن کاملSurpriseMe: an integrated tool for network community structure characterization using Surprise maximization
SUMMARY Detecting communities and densely connected groups may contribute to unravel the underlying relationships among the units present in diverse biological networks (e.g. interactomes, coexpression networks, ecological networks). We recently showed that communities can be precisely characterized by maximizing Surprise, a global network parameter. Here, we present SurpriseMe, a tool that int...
متن کاملExploring the limits of community detection strategies in complex networks
The characterization of network community structure has profound implications in several scientific areas. Therefore, testing the algorithms developed to establish the optimal division of a network into communities is a fundamental problem in the field. We performed here a highly detailed evaluation of community detection algorithms, which has two main novelties: 1) using complex closed benchma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 107 شماره
صفحات -
تاریخ انتشار 2000